3-Dimensional VLSI Routing

ثبت نشده
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial Time Algorithms for the 3-Dimensional VLSI Routing in the Cube

In previous works some polynomial time algorithms were presented for special cases of the 3-Dimensional VLSI Routing problem. Solutions were given to problems when all the terminals are either on a single face (SALP Single Active Layer Problem) or on two opposite faces (3DCRP 3-Dimensional Channel Routing Problem) or on two adjacent faces (3DΓRP 3-Dimensional Gamma Routing Problem) of a rectang...

متن کامل

Wiring requirement and three-dimensional integration technology for field programmable gate arrays

In this paper, analytical models for predicting interconnect requirements in field-programmable gate arrays (FPGAs) are presented, and opportunities for three-dimensional (3-D) implementation of FPGAs are examined. The analytical models for two-dimensional FPGAs are calibrated by routing and placement experiments with benchmark circuits and extended to 3-D FPGAs. Based on system-level modeling,...

متن کامل

Routing Congestion in VLSI Circuits - Estimation and Optimization

routing congestion in vlsi circuits estimation and routing congestion in vlsi circuits springer routing congestion in vlsi circuits estimation and routing congestion in vlsi circuits: estimation and routing congestion in vlsi circuits estimation and routing congestion in vlsi bookpro routing congestion in vlsi circuits estimation and routing congestion in vlsi circuits estimation and routing co...

متن کامل

Additive Approximation for Layer Minimization of Manhattan Switchbox Routing

Switchbox routing is one of the many problems arising in the field of VLSI routing. It requires interconnecting given sets of terminals that are placed on the boundaries of a rectangular circuit board using a 3-dimensional grid in a vertex-disjoint way. An important special case is the Manhattan Switchbox Routing problem. Here minimizing the number of layers of a routing (that is, the height of...

متن کامل

A Quadrant-XYZ Routing Algorithm for 3-D Asymmetric Torus Network-on-Chip

Three-Dimensional (3-D) ICs are able to obtain significant performance benefits over two-dimensional (2-D) ICs based on the electrical and mechanical properties resulting from the new geometrical arrangement. The arrangement of 3-D ICs also offers opportunities for new circuit architecture based on the geometric capacity. The emerging 3-D VLSI integration and process technologies allow the new ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009